Tootfinder

This https://arxiv.org/abs/2310.07256 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csGT_…

Finite-horizon Approximations and Episodic Equilibrium for Stochastic Games
This paper proposes a finite-horizon approximation scheme and introduces episodic equilibrium as a solution concept for stochastic games (SGs), where agents strategize based on the current state and episode stage. The paper also establishes an upper bound on the approximation error that decays with the episode length for both discounted and time-averaged utilities. This approach bridges the gap in the analysis of finite and infinite-horizon SGs, and provides a unifying framework to address time…

This https://arxiv.org/abs/2209.12044 has been replaced.
link: https://scholar.google.com/scholar?q=a

Characterising memory in infinite games
This paper is concerned with games of infinite duration played over potentially infinite graphs. Recently, Ohlmann (LICS 2022) presented a characterisation of objectives admitting optimal positional strategies, by means of universal graphs: an objective is positional if and only if it admits well-ordered monotone universal graphs. We extend Ohlmann's characterisation to encompass (finite or infinite) memory upper bounds. We prove that objectives admitting optimal strategies with $\varepsilon$…

Linear-Quadratic Mean Field Games in Hilbert spaces
Salvatore Federico, Fausto Gozzi, Daria Ghilli
https://arxiv.org/abs/2402.14935 https://

Linear-Quadratic Mean Field Games in Hilbert spaces
This paper represents the first attempt to develop a theory for linear-quadratic mean field games in possibly infinite dimensional Hilbert spaces. As a starting point, we study the case, considered in most finite dimensional contributions on the topic, where the dependence on the distribution enters just in the objective functional through the mean. This feature allows, similarly to the finite dimensional case, to reduce the usual mean field game system to a Riccati equation and a forward-backw…

This https://arxiv.org/abs/2307.06212 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csGT_…

Contract-Based Distributed Synthesis in Two-Objective Parity Games
We present a novel method to compute $\textit{assume-guarantee contracts}$ in non-zerosum two-player games over finite graphs where each player has a different $ ω$-regular winning condition. Given a game graph $G$ and two parity winning conditions $Φ_0$ and $Φ_1$ over $G$, we compute $\textit{contracted strategy-masks}$ ($\texttt{csm}$) $(Ψ_{i},Φ_{i})$ for each Player $i$. Within a $\texttt{csm}$, $Φ_{i}$ is a $\textit{permissive strategy template}$ which collects an infinite number of w…

This https://arxiv.org/abs/2209.12044 has been replaced.
link: https://scholar.google.com/scholar?q=a

Characterising memory in infinite games
This paper is concerned with games of infinite duration played over potentially infinite graphs. Recently, Ohlmann (LICS 2022) presented a characterisation of objectives admitting optimal positional strategies, by means of universal graphs: an objective is positional if and only if it admits well-ordered monotone universal graphs. We extend Ohlmann's characterisation to encompass (finite or infinite) memory upper bounds. We prove that objectives admitting optimal strategies with $\varepsilon$…

This https://arxiv.org/abs/2307.06212 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csGT_…

Contract-Based Distributed Synthesis in Two-Objective Parity Games
We present a novel method to compute $\textit{assume-guarantee contracts}$ in non-zerosum two-player games over finite graphs where each player has a different $ ω$-regular winning condition. Given a game graph $G$ and two parity winning conditions $Φ_0$ and $Φ_1$ over $G$, we compute $\textit{contracted strategy-masks}$ ($\texttt{csm}$) $(Ψ_{i},Φ_{i})$ for each Player $i$. Within a $\texttt{csm}$, $Φ_{i}$ is a $\textit{permissive strategy template}$ which collects an infinite number of w…